Justification announcements in discrete time. Part II: Frame definability results
نویسندگان
چکیده
منابع مشابه
Discrete Time Stochastic Hybrid Dynamic Games: Part II - Theory & Implications
This paper describes the theoretical background behind a stochastic game approach to probabilistic safety and reach-avoid problems for discrete time stochastic hybrid systems. In particular, we formulate these problems as stochastic zero-sum games between the control and a rational adversary. It will be shown that, under certain standard assumptions on the action spaces, a max-min control polic...
متن کاملSpace-time Coding for Aeronautical Telemetry: Part Ii – Experimental Results
Experiments involving side-by-side comparisons of traditional two-antenna transmissions and space-time coded (STC) transmissions involving two transmit antennas confirm theoretical predictions that space time coding is effective in removing signal dropouts caused by the “twoantenna problem.” The experiments involved real transmitters on an airborne platform and a prototype demodulator operating...
متن کاملExistential definability of modal frame classes
A class of Kripke frames is called modally definable if there is a set of modal formulas such that the class consists exactly of frames on which every formula from that set is valid, i. e. globally true under any valuation. Here, existential definability of Kripke frame classes is defined analogously, by demanding that each formula from a defining set is satisfiable under any valuation. This is...
متن کاملNaturality and Definability Ii
In two papers [3] and [4] we noted that in common practice many algebraic constructions are defined only ‘up to isomorphism’ rather than explicitly. We mentioned some questions raised by this fact, and we gave some partial answers. The present paper provides much fuller answers, though some questions remain open. Our main result, Theorem 4, says that there is a transitive model of Zermelo-Fraen...
متن کاملFrame-bound Priority Scheduling in Discrete-time Queueing Systems
A well-known problem with priority policies is starvation of delaytolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discretetime queueing system with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2018
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzy074